package jishu;
//判断字符串是否为全字母串
public class basic1832 {

    public boolean checkIfPangram(String sentence) {

        for (int i = 97; i <123 ; i++) {

            if(sentence.indexOf((char)i)<0){   //查找对应字母的索引  如果找到则返回正确索引位置，否则则为-1
                return false;
            }

        }
        return  true;

    }

    public static void main(String[] args) {

        basic1832 basic1832 = new basic1832();
        boolean leeff = basic1832.checkIfPangram("leeff");
        System.out.println(leeff);
    }
}
